package de.pass.ch.assign;

/**
 * Assignment-Klasse, benutzt fuer die Dijkstra-Suche.
 * @author Maximilian Schmitt
 *
 */
public class Assignment {

	private int _deletedID;
	private int _assignedID;
	private int _weight;
	private short _direction;
	private short _factor;
	private short _typ;

	public Assignment() {
		this(0, 0, 0, (short) 0, (short) 0, (short) 0);
	}

	public Assignment(int deletedID, int assignedID, int km, short direction,
			short factor, short typ) {
		_deletedID = deletedID;
		_assignedID = assignedID;
		_weight = km;
		_direction = direction;
		_factor = factor;
		_typ = typ;
	}

	public int getDeletedID() {
		return _deletedID;
	}

	public void setDeletedID(int deletedID) {
		this._deletedID = deletedID;
	}

	public int getAssignedID() {
		return _assignedID;
	}

	public void setAssignedID(int assignedID) {
		this._assignedID = assignedID;
	}

	public int getWeight() {
		return _weight;
	}

	public void setWeight(int weight) {
		this._weight = weight;
	}

	public short getDirection() {
		return _direction;
	}

	public void setDirection(short direction) {
		this._direction = direction;
	}

	public short getFactor() {
		return _factor;
	}

	public void setFactor(short factor) {
		this._factor = factor;
	}

	public short getTyp() {
		return _typ;
	}

	public void setTyp(short typ) {
		this._typ = typ;
	}

}
